Pii: S0010-4485(01)00053-7
نویسندگان
چکیده
United States industry spends billions of dollars as a result of poor interoperability between computer-aided engineering software tools. While ongoing standards development efforts are attempting to address this problem in today's tools, the more signi®cant demand in nextgeneration tools will be for representations that allow information used or generated during various product development activities to feed forward and backward into others by way of direct electronic interchange. Although the next generation of tools has the potential for greatly increased bene®ts, there is also a potential for the cost of poor interoperability to multiply. The goal of this work is to develop representations of information that are unavailable in traditional computer-aided engineering tools to support the exchange of product information in a distributed product development environment. This paper develops a vision of next-generation product development systems and provides a core representation for product development information on which future systems can be built. Published by Elsevier Science Ltd.
منابع مشابه
A foundation for interoperability in next-generation product development systems
Class DRP_Object{namestring# (UNIQUE, NOT NULL)information[Information]# (NOT NULL)references{[Reference]}is_referenced_by{[Reference]}is_member_of{[Set_Relationship]}is_special_member_of{[Directed_Set_Relationship]}} Abstract Class Restricted_DRP_Object # (inherits from DRP_Object){name(I)information(I)cons...
متن کاملVariable-radius circles of cluster merging in geometric constraints: I. Translational clusters
Variable-radius circles are common constructs in planar constraint solving and are usually not handled fully by algebraic constraint solvers. We give a complete treatment of variable-radius circles when such a circle must be determined simultaneously with placing two groups of geometric entities. The problem arises for instance in solvers using triangle decomposition to reduce the complexity of...
متن کاملAn extension algorithm for B-splines by curve unclamping
This paper presents an algorithm for extending B-spline curves and surfaces. Based on the unclamping algorithm for B-spline curves, we propose a new algorithm for extending B-spline curves that extrapolates using the recurrence property of the de Boor algorithm. This algorithm provides a nice extension, with maximum continuity, to the original curve segment. Moreover, it can be applied to the e...
متن کاملFlank milling with flat end milling cutters
In this paper, we give a detailed mathematical understanding of flank milling with flat end cutters, which we use to develop a method for milling with such a cutter. This method slides the cutter along two rails, providing two points of contact on the surface.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001